package summary;

/**
 * @Author: 海琳琦
 * @Date: 2022/4/5 20:15
 * https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/
 */
public class Title153 {

    public int findMin(int[] nums) {
        int left = 0;
        int right = nums.length - 1;
        while (left < right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] > nums[right]) {
                left = mid + 1;
            } else if (nums[mid] < nums[right]) {
                right = mid;
            }
        }
        return nums[left];
    }

    public static void main(String[] args) {

    }
}
